The Friedman Embedding Theorem
نویسنده
چکیده
In this paper, we will present an explicit construction of Harvey Friedman which to every finitely generated group G associates a 2-generator subgroup KG 6 Sym(N) such that G embeds into KG and such that if G ∼= H, then KG = KH .
منابع مشابه
Embedding normed linear spaces into $C(X)$
It is well known that every (real or complex) normed linear space $L$ is isometrically embeddable into $C(X)$ for some compact Hausdorff space $X$. Here $X$ is the closed unit ball of $L^*$ (the set of all continuous scalar-valued linear mappings on $L$) endowed with the weak$^*$ topology, which is compact by the Banach--Alaoglu theorem. We prove that the compact Hausdorff space $X$ can ...
متن کاملAn Algorithmic Friedman–pippenger Theorem on Tree Embeddings
T O D O :U pate gant nfo Abstract. An (n, d)-expander is a graph G = (V,E) such that for every X ⊆ V with |X| ≤ 2n − 2 we have |ΓG(X)| ≥ (d+1)|X|. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any (n, d)-expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for o...
متن کاملAnother proof of Banaschewski's surjection theorem
We present a new proof of Banaschewski's theorem stating that the completion lift of a uniform surjection is a surjection. The new procedure allows to extend the fact (and, similarly, the related theorem on closed uniform sublocales of complete uniform frames) to quasi-uniformities ("not necessarily symmetric uniformities"). Further, we show how a (regular) Cauchy point on a closed uniform subl...
متن کاملAn Algorithmic Friedman-Pippenger Theorem on Tree Embeddings and Applications
An (n, d)-expander is a graph G = (V,E) such that for every X ⊆ V with |X| ≤ 2n− 2 we have |ΓG(X)| ≥ (d + 1)|X|. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any (n, d)-expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, ...
متن کاملA New Optimal Solution Concept for Fuzzy Optimal Control Problems
In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...
متن کامل